The commuting graph of the symmetric inverse semigroup
نویسندگان
چکیده
منابع مشابه
Fiat categorification of the symmetric inverse semigroup and the semigroup
Starting from the symmetric group Sn , we construct two fiat 2-categories. One of them can be viewed as the fiat “extension” of the natural 2-category associated with the symmetric inverse semigroup (considered as an ordered semigroup with respect to the natural order). This 2-category provides a fiat categorification for the integral semigroup algebra of the symmetric inverse semigroup. The ot...
متن کاملcharacterization of the symmetric group by its non-commuting graph
the non-commuting graph $nabla(g)$ of a non-abelian group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we 'll prove that if $g$ is a finite group with $nabla(g)congnabla(bs_{n})$, then $g cong bs_{n}$, where $bs_{n}$ is the symmetric group of degre...
متن کاملnew semigroup compactifications via the enveloping semigroups of associated flows
this thesis deals with the construction of some function algebras whose corresponding semigroup compactification are universal with respect to some properies of their enveloping semigroups. the special properties are of beigan a left zero, a left simple, a group, an inflation of the right zero, and an inflation of the rectangular band.
15 صفحه اولLargest 2-generated Subsemigroups of the Symmetric Inverse Semigroup
The symmetric inverse monoid In is the set of all partial permutations of an n-element set. The largest possible size of a 2-generated subsemigroup of In is determined. Examples of semigroups with these sizes are given. Consequently, if M(n) denotes this maximum, it is shown that M(n)/|In| → 1 as n →∞. Furthermore, we may deduce, the already known fact, that In embeds as a local submonoid of an...
متن کاملFurther Combinatorial Properties of the Symmetric Inverse Semigroup
Let Xn = {1, 2, · · · , n} and let α : Domα ⊆ Xn → Imα ⊆ Xn be a (partial) transformation on Xn. The height of a transformation α is h(α) = | Imα|, the right [left] waist of α is w+(α) = max( Imα) [w−(α) = min( Imα)], and fix of α is denoted by f(α), and defined by f(α) = |F (α)| = |{x ∈ Xn : xα = x}|. In this note we obtain formulae involving binomial coefficients of F (n; p,m, k) = |{α ∈ In :...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2015
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-015-1173-9